Structure of the set of all minimal total dominating functions of some classes of graphs
نویسندگان
چکیده
In this paper we study some of the structural properties of the set of all minimal total dominating functions (FT ) of cycles and paths and introduce the idea of function reducible graphs and function separable graphs. It is proved that a function reducible graph is a function separable graph. We shall also see how the idea of function reducibility is used to study the structure of FT (G) for some classes of graphs.
منابع مشابه
$k$-tuple total restrained domination/domatic in graphs
For any integer $kgeq 1$, a set $S$ of vertices in a graph $G=(V,E)$ is a $k$-tuple total dominating set of $G$ if any vertex of $G$ is adjacent to at least $k$ vertices in $S$, and any vertex of $V-S$ is adjacent to at least $k$ vertices in $V-S$. The minimum number of vertices of such a set in $G$ we call the $k$-tuple total restrained domination number of $G$. The maximum num...
متن کاملTotal $k$-Rainbow domination numbers in graphs
Let $kgeq 1$ be an integer, and let $G$ be a graph. A {it$k$-rainbow dominating function} (or a {it $k$-RDF}) of $G$ is afunction $f$ from the vertex set $V(G)$ to the family of all subsetsof ${1,2,ldots ,k}$ such that for every $vin V(G)$ with$f(v)=emptyset $, the condition $bigcup_{uinN_{G}(v)}f(u)={1,2,ldots,k}$ is fulfilled, where $N_{G}(v)$ isthe open neighborhood of $v$. The {it weight} o...
متن کاملSome Results on the Maximal 2-Rainbow Domination Number in Graphs
A 2-rainbow dominating function ( ) of a graph is a function from the vertex set to the set of all subsets of the set such that for any vertex with the condition is fulfilled, where is the open neighborhood of . A maximal 2-rainbow dominating function on a graph is a 2-rainbow dominating function such that the set is not a dominating set of . The weight of a maximal is the value . ...
متن کاملSigned total Roman k-domination in directed graphs
Let $D$ be a finite and simple digraph with vertex set $V(D)$.A signed total Roman $k$-dominating function (STR$k$DF) on$D$ is a function $f:V(D)rightarrow{-1, 1, 2}$ satisfying the conditionsthat (i) $sum_{xin N^{-}(v)}f(x)ge k$ for each$vin V(D)$, where $N^{-}(v)$ consists of all vertices of $D$ fromwhich arcs go into $v$, and (ii) every vertex $u$ for which$f(u)=-1$ has a...
متن کاملIndependent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 30 شماره
صفحات -
تاریخ انتشار 2010